Complexity of multiplication with vectors for structured matrices
نویسندگان
چکیده
Fast algorithms for computing the product by a vector are presented for a number of classes of matrices whose properties relate to the properties of Toeplitz, Vandermonde or Cauchy matrices (these matrices are de ned using the concept of displacement of a matrix) and also for their inverses. All the actions which are not dependent upon the coordinates of the input vector are singled out in a separate preprocessing stage. The proposed algorithms are based on new representations of these matrices, involving factor circulants.
منابع مشابه
Nearly Optimal Bit Complexity Bounds for Computations with Structured Matrices
We present optimal, up to poly-logarithmic factors, bit complexity results for basic operations, matrix-vector multiplication and solving non-singular linear systems, with structured matrices.
متن کاملA Superfast Algorithm for Confluent Rational Tangential Interpolation Problem via Matrix-vector Multiplication for Confluent Cauchy-like Matrices∗
Various problems in pure and applied mathematics and engineering can be reformulated as linear algebra problems involving dense structured matrices. The structure of these dense matrices is understood in the sense that their n2 entries can be completeley described by a smaller number O(n) of parameters. Manipulating directly on these parameters allows us to design efficient fast algorithms. One...
متن کاملComplexity of Kronecker Operations on Sparse Matrices with Applications to Solution of Markov Models
We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to...
متن کاملComplexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models
We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to...
متن کاملNew Complexity Results for Field Multiplication using Optimal Normal Bases and Block Recombination
In this article, we propose new schemes for subquadratic arithmetic complexity multiplication in binary fields using optimal normal bases. The schemes are based on a recently proposed method known as block recombination, which efficiently computes the sum of two products of Toeplitz matrices and vectors. Specifically, here we take advantage of some structural properties of the matrices and vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994